Multistep finite control set model predictive control method and system for linear induction machines

ABSTRACT

A multistep finite control set model predictive control method for linear induction machines is provided, and the method belongs to a control technology field for linear induction machines. The method specifically includes the following steps: collecting a primary phase current of a linear induction machine in a three-phase coordinate system; solving a multistep reference voltage vector sequence by iteration according to a current value; keeping only two non-zero voltage vectors and one zero voltage vector that are closest to a reference voltage vector in each predictive step; and further eliminating a voltage vector sequence having a large cost function value through dynamic online comparison with a cost function value.

BACKGROUND Technical Field

The disclosure relates to a control technology field for linear induction machines, and in particular, relates to a multistep finite control set model predictive control method and system.

Description of Related Art

The electromagnetic structure of linear induction machines is derived from the rotary induction machines. In such a structure, the circular stator is sectioned and flattened along the radial direction and then becomes a straight line, so that linear motion is generated without the need for an intermediate transmission conversion device. However, because the structure at both ends of the linear machine is open, an end effect is generated, and the flux linkage may attenuate when the machine is running at a high speed, so it is difficult for the machine to generate high thrust at a high speed.

Since the linear machine parameters change drastically, the linear machine parameters may change with the operating conditions of the machine. Conventional control strategies include, for example, the vector control and direct thrust control strategy, but these strategies do not take into account the changes of machine parameters, so it is difficult to obtain a good control result. The model predictive control algorithm may be combined with the linear induction machine equivalent circuit model previously proposed by scholars, and the impact on parameter changes brought about by the end effect is fully considered, such that the operating performance of the machine is further improved.

In high-power applications, a linear induction machine driving system, such as a linear subway, has a low switching frequency, usually only a few hundred hertz. In order to obtain a smaller current distortion coefficient under a low switching frequency, a multistep finite control set model predictive control method may be adopted. By changing the step, the relationship between switching frequency and current quality is optimized. However, an increase in the number of predictive steps may increase the number of candidate voltage vector sequences exponentially, making the calculation of the algorithm more cumbersome. Therefore, it is necessary to find a simplified method that may reduce the amount of calculation of the multistep predictive control algorithm, so that the algorithm may be truly used in an actual control system.

SUMMARY

According to the above technical defects and requirements for improvements found in the related art, the disclosure provides a multistep finite control set model predictive control method for linear induction machines capable of compensating for an influence brought by an end effect, reasonably arranging a voltage vector switching sequence within a prediction range, and obtaining a small current distortion coefficient at a low switching frequency.

To accomplish the foregoing purposes, the following technical solutions are adopted by the disclosure.

(This content of this part will be filled in by the agent after the claims are confirmed)

In general, the above technical solutions provided by the disclosure have the following beneficial effects compared with the related art.

1. In the disclosure, the multistep finite control set model predictive control method is adopted and is combined with the machine equivalent circuit model, and in this way, the influence brought by the end effect is compensated, the voltage vector switching sequence is reasonably arranged within the prediction range, and a small current distortion coefficient is obtained at a low switching frequency.

2. Further, in the disclosure, the multistep finite control set model predictive control algorithm is simplified, and by determining the sector of each reference voltage vector in the reference voltage sequence, the filtered voltage vector sequence may be obtained. In order to avoid analyzing the possible situations of other sectors, the reference voltage vector may be converted to the first sector to lower the hardware costs required by the algorithm, so that the algorithm may be widely applied in an actual driving control system.

3. In the disclosure, in order to further reduce the number of the candidate voltage vector sequences, the voltage vector sequences away from the reference voltage vector sequence may be eliminated in advance. In each predictive step, only two non-zero voltage vectors and one zero voltage vector that are closest to the reference voltage vector are kept. That is, only 3 voltage vectors are evaluated in each predictive step, and in the last predictive step, only the voltage vector closest to the reference voltage vector is required to be selected to minimize the cost function. After irrelevant voltage vector sequences are excluded, the number of voltage vectors that need to be evaluated is reduced to N×3^(N−1).

To sum up, in the disclosure, the multistep finite control set model predictive control method is applied to the linear induction machines to improve the operating performance of the linear induction machines, especially in applications of low switching frequency. In order to lower the amount of calculation to be performed by the algorithm, the control method is simplified, and the hardware costs required for execution of the method are reduced, so that the method may be applied in an actual system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a circuit diagram of a structure of a linear induction machine.

FIG. 2 depicts sector division regions in a single-step finite control set model predictive control method.

FIG. 3 is a process of selecting a voltage vector through multistep finite control set model predictive control.

FIG. 4 depicts sector division regions in a multistep finite control set model predictive control method.

FIG. 5 is a flow chart of a control method provided by the disclosure.

DESCRIPTION OF THE EMBODIMENTS

To better illustrate the goal, technical solutions, and advantages of the disclosure, the following embodiments accompanied with drawings are provided so that the disclosure are further described in detail. It should be understood that the specific embodiments described herein serve to explain the disclosure merely and are not used to limit the disclosure. In addition, the technical features involved in the various embodiments of the disclosure described below can be combined with each other as long as the technical features do not conflict with each other.

I. Establishing Mathematical Model of Linear Induction Machine in αβ Coordinate System

In order to compensate for an end effect produced by a linear induction machine during operation, an end effect impact factor is introduced:

$\begin{matrix} {Q = \frac{DR_{2}}{v\left( {L_{l2} + L_{m}} \right)}} & (1) \end{matrix}$

where D is a primary length of the machine, v is a linear speed of the machine, R₂ is secondary resistance of the machine, L_(l2) is secondary inductance of the machine, and L_(m) is mutual inductance when the machine is stationary.

According to a circuit diagram of a structure of the linear induction machine in FIG. 1, a machine voltage formula may be obtained as follows:

$\begin{matrix} \left\{ \begin{matrix} {u_{\alpha 1} = {{R_{1}i_{\alpha 1}} + \frac{d\psi_{\alpha 1}}{dt}}} \\ {u_{\beta 1} = {{R_{1}i_{\beta 1}} + \frac{d\psi_{\beta 1}}{dt}}} \\ {0 = {{R_{2}i_{\alpha 2}} + \frac{d\psi_{\alpha 2}}{dt} + {\omega_{2}\psi_{\beta 2}}}} \\ {0 = {{R_{2}i_{\beta 2}} + \frac{d\psi_{\beta 2}}{dt} - {\omega_{2}\psi_{\alpha 2}}}} \end{matrix} \right. & (2) \end{matrix}$

a flux linkage formula of the machine is:

$\begin{matrix} \left\{ \begin{matrix} {\psi_{\alpha 1} = {{L_{l1}i_{\alpha 1}} + {{L_{m}\left\lbrack {1 - {f(Q)}} \right\rbrack}\left( {i_{\alpha 1} + i_{\alpha 2}} \right)}}} \\ {\psi_{\beta 1} = {{L_{l\; 1}i_{\beta 1}} + {{L_{m}\left\lbrack {1 - {f(Q)}} \right\rbrack}\left( {i_{\beta 1} + i_{\beta 2}} \right)}}} \\ {\psi_{\alpha 2} = {{L_{l\; 2}i_{\alpha 2}} + {{L_{m}\left\lbrack {1 - {f(Q)}} \right\rbrack}\left( {i_{\alpha 1} + i_{\alpha 2}} \right)}}} \\ {\psi_{\beta 2} = {{L_{l\; 2}i_{\beta 2}} + {{L_{m}\left\lbrack {1 - {f(Q)}} \right\rbrack}\left( {i_{\beta 1} + i_{\beta 2}} \right)}}} \end{matrix} \right. & (3) \end{matrix}$

where subscripts 1 and 2 respectively represent a primary variable and a secondary variable of the machine, subscripts α and β respectively represent variables of an α axis and a β axis of the machine, ω₂ represents a secondary angular velocity, u represents a voltage, i represents a current, R represents resistance, ψ represents flux linkage of the machine, L_(l) represents leakage inductance of the machine, and

${f(Q)} = {\frac{1 - e^{- Q}}{Q}.}$

A state variable [i_(α1), i_(β1), ψ_(α2), ψ_(β2)] is selected, the machine voltage formula is combined with the flux linkage formula, and the following may be obtained:

$\begin{matrix} {\quad\left\{ \begin{matrix} {\frac{di_{\alpha 1}}{dt} = {\frac{u_{\alpha 1}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}} - {\frac{\begin{pmatrix} {R_{1} +} \\ \frac{R_{2}L_{m}^{2}}{L_{r}^{2}} \end{pmatrix}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}i_{\alpha 1}} + {\frac{\frac{R_{2}L_{m}}{L_{r}^{2}}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}\psi_{\alpha 2}} + {\frac{\frac{L_{m}}{L_{r}}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}\omega_{2}\psi_{\beta 2}}}} \\ {\frac{di_{\beta 1}}{dt} = {\frac{u_{\beta 1}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}} - {\frac{\begin{pmatrix} {R_{1} +} \\ \frac{R_{2}L_{m}^{2}}{L_{r}^{2}} \end{pmatrix}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}i_{\beta 1}} + {\frac{\frac{R_{2}L_{m}}{L_{r}^{2}}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}\psi_{\beta 2}} - {\frac{\frac{L_{m}}{L_{r}}}{\begin{pmatrix} {L_{s} -} \\ \frac{L_{m}^{2}}{L_{r}} \end{pmatrix}}\omega_{2}\psi_{\alpha 2}}}} \\ {\frac{d\psi_{\alpha 2}}{dt} = {{\frac{R_{2}L_{m}}{L_{r}}i_{\alpha 1}} - {\frac{R_{2}}{L_{r}}\psi_{\alpha 2}} - {\omega_{2}\psi_{\beta 2}}}} \\ {\frac{d\psi_{\beta 2}}{dt} = {{\omega_{2}\psi_{\alpha 2}} + {\frac{R_{2}L_{m}}{L_{r}}i_{\beta 1}} - {\frac{R_{2}}{L_{r}}\psi_{\beta 2}}}} \end{matrix} \right.} & (4) \end{matrix}$

where L_(r)=L_(l2)+L_(m)[1−f (Q)], L_(s)=L_(l1)+L_(m)[1−f (Q)], and L_(m)=L_(m)[1−f (Q)].

Further, formula (4) is expressed as a vector form, which may be expressed as:

$\begin{matrix} \left\{ {\begin{matrix} {\frac{dI_{1}}{dt} = {\frac{L_{r}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}\left( {V_{1} - {\left( {R_{1} + \frac{R_{2}L_{m}^{2}}{L_{r}^{2}}} \right)I_{1}} + {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} - {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}} \right)}} \\ {\frac{d\psi_{2}}{dt} = {{\frac{R_{2}L_{m}}{L_{r}}I_{1}} - {\frac{R_{2}}{L_{r}}\psi_{2}} + {j\omega_{2}\psi_{2}}}} \end{matrix},} \right. & (5) \end{matrix}$

where I₁=i_(α1)+ji_(β1), V₁=u_(α1)+ju_(β1), and ψ₂=ψ_(α2)+jψ_(β2).

A first-order Euler discretization method is applied, discretization is performed to formula (5), and the following may be obtained:

$\begin{matrix} {{I_{1}^{k + 1} = {\left. {{\left( {1 - \frac{T_{s}\left( {{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}} \right)}{\left( {{L_{r}^{2}L_{s}} - {L_{r}L_{m}^{2}}} \right)}} \right)I_{1}^{k}} + {\frac{L_{r}T_{s}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}\left( {V_{1}^{k} + {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}^{k}} - {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}^{k}}} \right)}}\Rightarrow I_{1}^{k + 1} \right. = {{M\; I_{1}^{k}} + {HV_{1}^{k}} + L_{\psi}^{k}}}},} & (6) \end{matrix}$

where T_(s) is a sampling period.

II. Simplification of Single-Step Finite Control Set Model Predictive Control Method

At kth time step of present, it is necessary to sample the current at this time. In order to compensate for control delay caused by calculation, formula (6) needs to be adopted to predict and obtain a predicted current at (k+1)th time step to compensate for the calculation delay. A cost function may be expressed as:

J=∥I* ₁ −I ₁ ^(k+2)∥² +k _(sw) ∥V ₁ ^(k+1) −V ₁ ^(k)∥²  (7)

where I*₁ is a reference value of a current vector, and k_(sw) is a weighting factor configured for balancing a current tracking error and a switching frequency penalty term.

For a two-level inverter, in a conventional search method, seven different voltage vectors are required to be brought into formula (6) for prediction, and the obtained predicted values are brought into formula (7) for evaluation. The voltage vector with a smallest cost function value is selected as an optimal voltage vector. It thus can be seen that this search method requires much calculation time to solve an optimal control amount.

In order to simplify an amount of calculation in the case of single-step prediction, formula (6) is incorporated into formula (7), and the cost function may be rewritten as:

$\begin{matrix} {{J = {\left. {\left( \frac{L_{r}T_{s}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)} \right)^{2}J_{1}}\Rightarrow J_{1} \right. = {\left. {{{V_{1}^{k + 1} - V_{k + 1}^{*}}}^{2} + {\frac{{k_{sw}\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}^{2}}{\left( {L_{r}T_{s}} \right)^{2}}{{V_{1}^{k + 1} - V_{1}^{k}}}^{2}}}\Rightarrow J_{1} \right. = {\left. {{{V_{1}^{k + 1} - V_{k + 1}^{*}}}^{2} + {\lambda{{V_{1}^{k + 1} - V_{1}^{k}}}^{2}}}\Rightarrow J_{1} \right. = {{\left( {1 + \lambda} \right){{V_{1}^{k + 1} - \frac{V_{k + 1}^{*} + {\lambda V_{1}^{k}}}{1 + \lambda}}}^{2}} + Z_{k + 1}^{1}}}}}},} & (8) \end{matrix}$ where:

$\begin{matrix} {V_{k + 1}^{*} = {\left. {{\left( {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}} \right)I_{1}^{k + 1}} + {\frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}I_{1}^{*}} - {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}^{k + 1}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}^{k + 1}}}\Rightarrow V_{k + 1}^{*} \right. = {{a\; I_{1}^{k + 1}} + {bI_{1}^{*}} + D_{\psi}^{k + 1}}}} & (9) \\ {\mspace{79mu}{Z_{k + 1}^{1} = {\frac{\lambda}{1 + \lambda}{{{V_{k + 1}^{*} - V_{1}^{k}}}^{2}.}}}} & (10) \end{matrix}$

Since Z_(k+1) ¹ is a constant term that changes with time, it does not change with different candidate voltage vectors. As such, the cost function may be simplified as:

$\begin{matrix} {J_{1}^{\prime} = {{{V_{1}^{k + 1} - \frac{V_{k + 1}^{*} + {\lambda V_{1}^{k}}}{1 + \lambda}}}^{2} = {{{V_{1}^{k + 1} - U_{1{({k + 1})}}^{*}}}^{2}.}}} & (11) \end{matrix}$

According to formula (11), it can be known that the optimal voltage vector that minimizes the cost function value is the closest to a reference voltage vector U*_(1(k+1)). Therefore, in order to facilitate comparison of the distance between the two, sector division may be performed as shown in FIG. 2. By determining the sector to which a reference voltage belongs, the candidate voltage vector of the same sector is selected as the optimal voltage vector.

III. Simplification of Multistep Finite Control Set Model Predictive Control Method

When the predictive step of the finite control set model predictive control algorithm is further increased, a voltage vector sequence needs to be optimized at this time instead of a single voltage vector. Therefore, when the predicted step is N steps, for a two-level inverter, a number of the candidate voltage vectors that need to be evaluated and compared increases from the original 7 to N×7^(N). The number of the candidate voltage vectors increases exponentially, resulting in a heavy calculation for the multistep predictive control algorithm. It is thus necessary to reduce the number of the candidate voltage vectors to further reduce the online calculation of the algorithm.

When the predictive step is N steps, the cost function expression of the multistep finite control set model predictive control algorithm may be written according to formula (8), which may be expressed as:

$\begin{matrix} {J_{N} = {{\sum\limits_{i = 1}^{N}{{V_{1}^{k + i} - V_{k + i}^{*}}}^{2}} + {\lambda{\sum\limits_{i = 1}^{N}{{{V_{1}^{k + i} - V_{1}^{k + i - 1}}}^{2}.}}}}} & (12) \end{matrix}$

For the sake of simplicity, it is assumed that the secondary flux linkage and angular velocity remain unchanged within the predicted step, and the current vector reference value also remains unchanged, that is: I*_(k+2)=I*_(k+1)=I*₁. At this time, by incorporating formula (6) into formula (9), a recurrence expression between the reference voltage vectors under different predictive steps may be obtained and may be expressed as:

V* _(k+2) =aI ₁ ^(k+2) +bI* ₁ +D _(ψ) ^(k+1)

⇒V* _(k+2) =a(MI ₁ ^(k+1) +HV ₁ ^(k+1) +L _(ψ) ^(k+1))+bI* ₁ +D _(ψ) ^(k+1)

⇒V* _(k+2) =AI ₁ ^(k+1) +BV ₁ ^(k+1) +G _(k+1)  (13).

In order to further simplify formula (12), the following formula is derived and is expressed as:

$\begin{matrix} {{{l_{1}{{V - V_{1}}}^{2}} + \ldots + {l_{n}{{V - V_{n}}}^{2}}} = {{\left( {l_{1} + \ldots + l_{n}} \right){{V - \frac{{l_{1}V_{1}} + \ldots + {l_{n}V_{n}}}{l_{1} + \ldots + l_{n}}}}^{2}} + {\frac{l_{n}\left( {l_{1} + \ldots + l_{n - 1}} \right)}{l_{1} + \ldots + l_{n}}{{\frac{{l_{1}V_{1}} + \ldots + {l_{n - 1}V_{n - 1}}}{l_{1} + \ldots + l_{n - 1}} - V_{n}}}^{2}} + \ldots + {\frac{l_{1}l_{2}}{l_{1} + l_{2}}{{{V_{1} - V_{2}}}^{2}.}}}} & (14) \end{matrix}$

Through repeatedly using formulas (6), (13), and (14) by iteration, formula (12) may be rewritten as:

$\begin{matrix} {J_{N} = {{\sum\limits_{i = 1}^{N}{K_{i}{{V_{1}^{k + i} - U_{{({N + 1 - i})}{({k + i})}}^{*}}}^{2}}} + {Z_{k + 1}^{N}.}}} & (15) \end{matrix}$

The recurrence relation expression of the variables in the above formula is:

$\begin{matrix} \left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix},} \right. & (16) \\ {{Z_{k + 1}^{1} = {{\frac{\lambda}{1 + \lambda}{{V_{k + 1}^{*} - V_{1}^{k}}}^{2}Z_{k + 1}^{2}} = {{{\frac{\lambda}{1 + \lambda}{{V_{k + 1}^{*} - V_{1}^{k}}}^{2}} + {\frac{k_{1}\left( {1 + \lambda} \right)}{1 + \lambda + k_{1}}{{\frac{V_{k + 1}^{*} + {\lambda\; V_{1}^{k}}}{1 + \lambda} - V_{k + 1}^{1}}}^{2}Z_{k + 1}^{N}}} = {Z_{k + 1}^{2} + {\sum\limits_{i = 2}^{N - 1}{\frac{k_{i}\left( {1 + \lambda + k_{1} + {\ldots\mspace{20mu} k_{i - 1}}} \right)}{1 + \lambda + k_{1} + {\ldots\mspace{14mu} k_{i}}}{{U_{i{({k + 1})}}^{*} - V_{k + 1}^{i}}}^{2}\mspace{20mu}\left( {N \geq 3} \right)}}}}}},} & (17) \\ {{k_{1} = \frac{{\lambda\left( {1 - B} \right)}^{2}}{1 + \lambda}},{k_{2} = {\frac{k_{1}\left( {1 + \lambda} \right)}{1 + \lambda + k_{1}}K_{2V}^{2}}},{k_{i} = {\frac{k_{i - 1}1\left( {1 + \lambda + k_{1} + \ldots + k_{i - 2}} \right)}{1 + \lambda + k_{1}\mspace{11mu} + \;\ldots + k_{i - 1}}{K_{i\; V}^{2}\left( {i \geq 3} \right)}}},} & (18) \\ {{U_{1{({k + 1})}}^{*} = {{\frac{V_{k + 1}^{*} + {\lambda V_{1}^{k}}}{1 + \lambda}U_{2{({k + 1})}}^{*}} = \frac{V_{k + 1}^{*} + {\lambda V_{1}^{k}} + {k_{1}V_{k + 1}^{1}}}{1 + \lambda + k_{1}}}}{{U_{{({N + 1 - i})}{({k + i})}}^{*} = {\frac{V_{k + i}^{*} + {\lambda V_{1}^{k + i - 1}} + {k_{1}V_{k + i}^{1}} + \ldots + {k_{N - i}V_{k + i}^{N - i}}}{1 + \lambda + k_{1} + \ldots + k_{N - i}}\mspace{14mu}\left( {{N + 1 - i} \geq 3} \right)}},}} & (19) \\ {{V_{k + i}^{h} = \frac{{K_{hI}I_{1}^{k + i}} + {K_{hG}G_{k + 1}} + {K_{hL}L_{\psi}^{k + 1}}}{K_{h\; V}}},} & (20) \\ \left\{ {\begin{matrix} {K_{1V} = {1 - B}} \\ {K_{2V} = {\frac{K_{1I}H}{K_{1V}} - \frac{B + \lambda}{1 + \lambda}}} \\ \ldots \\ {K_{h\; V} = {\frac{K_{{({h - 1})}I}H}{K_{{({h - 1})}V}} - \frac{B + \lambda}{1 + \lambda + k_{1} + \ldots + k_{h - 2}} - {\sum\limits_{i = 1}^{h - 2}{\frac{K_{i\; I}H}{K_{i\; V}}\frac{k_{i}}{1 + \lambda + {k_{1}\mspace{14mu}\ldots} + k_{h - 2}}}}}} \end{matrix},} \right. & (21) \\ \left\{ {\begin{matrix} {K_{1I} = A} \\ {K_{2I} = {\frac{A}{1 + \lambda} - \frac{K_{1I}M}{K_{1V}}}} \\ \ldots \\ {K_{h\; I} = {\frac{A}{1 + \lambda + k_{1} + \ldots + k_{h - 2}} - \frac{K_{{({h - 1})}I}M}{K_{{({h - 1})}V}} + {\sum\limits_{i = 1}^{h - 2}{\frac{K_{iI}M}{K_{i\; V}}\frac{k_{i}}{1 + \lambda + k_{1} + \ldots + k_{h - 2}}}}}} \end{matrix},} \right. & (22) \\ \left\{ {\begin{matrix} {K_{1G} = 1} \\ {K_{2G} = {\frac{1}{1 + \lambda} - \frac{K_{1G}}{K_{1V}}}} \\ \ldots \\ {K_{hG} = {\frac{1}{1 + \lambda + k_{1} + \ldots + k_{h - 2}} - \frac{K_{{({h - 1})}G}}{K_{{({h - 1})}V}} + {\sum\limits_{i = 1}^{h - 2}{\frac{K_{i\; G}}{K_{i\; V}}\frac{k_{i}}{k_{1} + \ldots + k_{n - 2}}}}}} \end{matrix},{and}} \right. & (23) \\ \left\{ {\begin{matrix} {K_{1\; L} = 0} \\ {K_{2\; L} = {- \frac{K_{1I} + K_{1L}}{K_{1V}}}} \\ \ldots \\ {K_{h\; L} = {{\sum\limits_{i = 1}^{h - 2}\;{\frac{K_{i\; I} + K_{i\; L}}{K_{i\; V}}\frac{k_{i}}{1 + \lambda + k_{1} + \ldots + k_{h - 2}}}} - \frac{K_{{({h - 1})}I} + K_{{({h - 1})}L}}{K_{{({h - 1})}V}}}} \end{matrix}.} \right. & (24) \end{matrix}$

Since Z_(k+1) ^(N) only changes with time, the value does not change when a different voltage vector sequence is applied. Therefore, the cost function value is only related to the first term, that is, the distance between the candidate voltage vector sequence (V₁ ^(k+1), . . . , V₁ ^(k+N)) and the reference voltage vector sequence (U*_(N(k+1)), . . . , U*_(1(k+N))). The cost function may be simplified as:

$\begin{matrix} {J_{N} = {{\sum\limits_{i = 1}^{N}{K_{i}{{V_{1}^{k + i} - U_{{({N + 1 - i})}{({k + i})}}^{*}}}^{2}}} + {Z_{k + 1}^{N}.}}} & (25) \end{matrix}$

In order to further reduce a number of the candidate voltage vector sequences, the voltage vector sequences away from the reference voltage vector sequence may be eliminated in advance. As shown in FIG. 3, in each predictive step, only two non-zero voltage vectors and one zero voltage vector that are closest to the reference voltage vector are kept. That is, only 3 voltage vectors are evaluated in each predictive step, and in the last predictive step, only the voltage vector closest to the reference voltage vector is required to be selected to minimize the cost function. After irrelevant voltage vector sequences are excluded, a number of voltage vectors that need to be evaluated is reduced to N×3^(N−1).

By determining the sector of each reference voltage vector in the reference voltage sequence, the filtered voltage vector sequence may be obtained, and the sector division is shown in FIG. 4. In order to avoid analyzing the possible situations of other sectors, the reference voltage vector may be converted to a first sector by the following formula, the expression is:

$\begin{matrix} {{T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}},} & (26) \end{matrix}$

where n is the sector of the reference voltage vector.

Through the reference voltage vector Ū*_((N+1−i)(k+i)) processed by formula (26), the 3 voltage vectors that are filtered out may be further sorted as follows:

$\begin{matrix} {S_{n}^{k + \prime} = \left\{ {\begin{matrix} {\left\{ {V_{n},V_{n + 1},V_{0}} \right\}\mspace{20mu}} & {{X > 0},{Y > 0}} \\ {\left\{ {V_{n},V_{n - 1},V_{0}} \right\}\mspace{20mu}} & {{X > 0},{Y < 0}} \\ {\left\{ {V_{0},V_{n},V_{n + 1}} \right\}\mspace{20mu}} & {{X < 0},{Y > 0}} \\ {\left\{ {V_{0},V_{n},V_{n - 1}} \right\}\mspace{20mu}} & {{X < 0},{Y < 0}} \end{matrix},} \right.} & (27) \end{matrix}$

where X=Re(Ū*_((N+1−i)(k+i)))−V_(dc)/3, Y=Im(Ū*_((N+1−i)(k+i))) and V_(dc) is a direct-current bus voltage. If n=1, V_(n−1) is V₆ and if n=6, V_(n+1) is V₁.

Therefore, in the last predictive step, only the first voltage vector in equation (27), i.e., S_(N)(1), is required to be selected. Nevertheless, in other predictive steps, it is necessary to compare and evaluate each voltage vector according to the sorting sequence of formula (27), i.e., S_(i)(1,2,3). Evaluation in this order may make the cost function value small at the beginning, and the probability of becoming the optimal voltage vector sequence is greater because the later the cost function value is searched, the probability of becoming the optimal voltage vector sequence is lower. Based on the above, in each predictive step, the calculated cost function value is compared with the current optimal cost function value. If it is greater than the optimal value, this voltage vector sequence may be discarded and the next voltage vector sequence is selected for evaluation. Through such processing, some voltage vectors may be dynamically removed online, and the amount of calculation is further reduced.

IV. An execution flow chart of a final simplified algorithm is shown in FIG. 5, and the multistep finite control set model predictive control method for linear induction machines provided by the disclosure includes the following steps.

(1) At kth time step of present, a primary phase current i_(p) ^(k) of a linear induction machine in a three-phase coordinate system is collected and converted to an αβ coordinate system to obtain a current vector value I₁ ^(k).

(2) A current vector value I₁ ^(k+1) at (k+1)th time step is predicted according to the current vector value I₁ ^(k) at the kth time step.

(3) A reference voltage vector

$U_{{({N + 1 - i})}{({k + i})}}^{*} = \frac{V_{k + i}^{*} + {\lambda V_{1}^{k + i - 1}} + {k_{1}V_{k + i}^{1}} + \ldots + {k_{N - i}V_{k + i}^{N - i}}}{1 + \lambda + k_{1} + \ldots + k_{N - i}}$

at (k+i)th time step is calculated by iteration by treating the current vector value I₁ ^(k+1) as an initial value. Predictive time i=1, L, N, and N is a total predictive step number, where

${V_{k + i}^{*} = {{\left( {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}} \right)I_{1}^{k + i}} + {\frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}I_{1}^{*}} - {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}},V_{1}^{k + i - 1}$

is a voltage vector selected at (k+i−1)th time step,

${V_{k + i}^{h} = \frac{{K_{hI}I_{1}^{k + i}} + {K_{hG}G_{k + 1}} + {K_{hL}L_{\psi}^{k + 1}}}{K_{h\; V}}},{h = 1},L,{N - i},$

λ is a weighting factor,

${k_{1} = \frac{{\lambda\left( {1 - B} \right)}^{2}}{1 + \lambda}},{k_{2} = {\frac{k_{1}\left( {1 + \lambda} \right)}{1 + \lambda + k_{\iota}}K_{2V}^{2}}},{k_{h} = {\frac{k_{h - 1}\left( {1 + \lambda + k_{1} + \ldots + k_{h - 2}} \right)}{1 + \lambda + k_{\iota} + \ldots + k_{h - 1}}K_{h\; V}^{2}}},{L_{\psi}^{k} = {\frac{L_{r}T_{s}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}\left( {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} - {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}} \right)}},{G_{k + 1} = {{a\; L_{\psi}^{k - 1}} + {b\; I_{1}^{*}} + D_{\psi}^{k + 1}}},$

a and b are coefficients,

${a = {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}}},{b = \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}},{{{and}\mspace{14mu} D_{\psi}^{k + 1}} = {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}},$

T_(s) is a sampling period, I*₁ is a reference current command, j represents an imaginary part, R represents resistance, ψ represents flux linkage of a machine, subscripts 1 and 2 respectively represent a primary variable and a secondary variable of the machine, ω₂ represents a secondary angular velocity, L_(l) represents leakage inductance of the machine; L_(r) is secondary inductance, L_(s) is primary inductance, and L_(m) is mutual inductance.

Next, according to a preferred embodiment, in the disclosure, through the subsequent steps, the control method is simplified, and hardware costs required for execution of the method are reduced, so that the algorithm may be applied in an actual system.

(4) An inverter output voltage range is equally divided into six sectors designated as first to sixth sectors in a counterclockwise direction, the sectors to which reference voltage vectors at time V_(k+1), L, V_(k+N) belong are determined one by one, and a reference voltage vector angle of each sector is converted to a first sector.

(5) Filtering and sorting are performed to obtain an inverter candidate output voltage sequence

$S_{n}^{k + i} = \left\{ \begin{matrix} {{{\left\{ {V_{n},V_{n + 1},V_{0}} \right\}\mspace{20mu} X} > 0},{Y > 0}} \\ {{{\left\{ {V_{n},V_{n - 1},V_{0}} \right\}\mspace{20mu} X} > 0},{Y < 0}} \\ {{{\left\{ {V_{0},V_{n},V_{n + 1}} \right\}\mspace{20mu} X} < 0},{Y > 0}} \\ {{{\left\{ {V_{0},V_{n},V_{n - 1}} \right\}\mspace{20mu} X} < 0},{Y < 0}} \end{matrix} \right.$

according to a reference voltage vector Ū*_((N+1−i)(k+i)) converted into the first sector, where X=Re(Ū*_((N+1−i)(k+i)))−V_(dc)/3, Y=IM(U*_((N+1−i)(k+i))), V_(dc) is a direct-current bus voltage, V₀ is a zero voltage vector outputted by an inverter, and V_(n), V_(n+1), V_(n−1) are non-zero voltage vectors outputted by the inverter.

(6) An optimal voltage vector sequence is searched from the inverter candidate output voltage sequence S_(n) ^(k+i) by treating a minimum cost function value as a goal.

More specifically, the reference voltage vector angle of each sector is converted to the first sector through an angle conversion formula, and the angle conversion formula is:

${T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}},$

where n is a serial number of the sector to which the reference voltage vector belongs.

More specifically, the cost function value is represented as:

${J_{N} = {\sum\limits_{i = 1}^{N}{K_{i}{{S_{n}^{k + i} - U_{{({N + 1 - i})}{({k + i})}}^{*}}}^{2}}}},$

where:

$\quad\left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix},} \right.$

and U*_((N+1−i)(k+i)) represents the reference voltage vector at the (k+i)th time step.

In the disclosure, the multistep finite control set model predictive control method is applied to the linear induction machines to improve operating performance of the linear induction machines, especially in applications of low switching frequency. Further, the control method is simplified, and the hardware costs required for execution of the method are reduced, so that the method may be applied in an actual system.

A person having ordinary skill in the art should be able to easily understand that the above description is only preferred embodiments of the disclosure and is not intended to limit the disclosure. Any modifications, equivalent replacements, and modifications made without departing from the spirit and principles of the disclosure should fall within the protection scope of the disclosure. 

To the claims:
 1. A multistep finite control set model predictive control method for linear induction machines, comprising: step 1 of collecting and converting a primary phase current i_(p) ^(k) of a linear induction machine in a three-phase coordinate system to an αβ coordinate system to obtain a current vector value I₁ ^(k) at kth time step of present; step 2 of predicting a current vector value I₁ ^(k+1) at (k+1)th time step according to the current vector value I₁ ^(k) at the kth time step; step 3 of calculating a reference voltage vector $U_{{({N + 1 - i})}{({k + i})}}^{*} = \frac{V_{k + i}^{*} + {\lambda V_{1}^{k + i - 1}} + {k_{1}V_{k + i}^{1}} + \ldots + {k_{N - i}V_{k + i}^{N - i}}}{1 + \lambda + k_{1} + \ldots + k_{N - i}}$ at the (k+i)th time step by iteration by treating the current vector value I₁ ^(k+1) as an initial value, wherein predictive time i=1, L, and N, and N is a total predictive step number, wherein ${V_{k + i}^{*} = {{\left( {\frac{\begin{matrix} {{L_{r}^{2}R_{1}} +} \\ {R_{2}L_{m}^{2}} \end{matrix}}{L_{r}^{2}} - \frac{\begin{matrix} {{L_{r}L_{s}} -} \\ L_{m}^{2} \end{matrix}}{L_{r}T_{s}}} \right)I_{1}^{k + i}} + {\frac{\begin{matrix} {{L_{r}L_{s}} -} \\ L_{m}^{2} \end{matrix}}{L_{r}T_{s}}I_{1}^{*}} - {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}},\mspace{79mu}{V_{1}^{k + i - 1}\mspace{14mu}{is}\mspace{14mu} a}$ voltage vector selected at (k+i−1)th time step, ${V_{k + i}^{h} = \frac{{K_{hI}I_{1}^{k + i}} + {K_{hG}G_{k + 1}} + {K_{hL}L_{\psi}^{k + 1}}}{K_{hV}}},{h = 1},L,{N - i},$ λ is a weighting factor, ${k_{1} = \frac{{\lambda\left( {1 - B} \right)}^{2}}{1 + \lambda}},{k_{2} = {\frac{k_{1}\left( {1 + \lambda} \right)}{1 + \lambda + k_{1}}K_{2V}^{2}}},{k_{h} = {\frac{k_{h - 1}\left( {1 + \lambda + k_{1} + \ldots + k_{h - 2}} \right)}{1 + \lambda + k_{1} + \ldots + k_{h - 1}}K_{hV}^{2}}},{L_{\psi}^{k} = {\frac{L_{r}T_{s}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}\left( {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} - {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}} \right)}},{G_{k + 1} = {{aL_{\psi}^{k + 1}} + {b\; I_{1}^{*}} + D_{\psi}^{k + 1}}},$ a and b are coefficients, ${a = {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}}},{b = \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}},{{{{and}\mspace{14mu} D_{\psi}^{k + 1}} = {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}};}$ T_(s) is a sampling period, I*₁ is a reference current command, j represents an imaginary part, R represents resistance, ψ represents flux linkage of linear induction machine, subscripts 1 and 2 respectively represent a primary variable and a secondary variable of the linear induction machine, ω₂ represents a secondary angular velocity, L_(l) represents leakage inductance of the linear induction machine; L_(r) is secondary inductance, L_(s) is primary inductance, and L_(m) is mutual inductance.
 2. The multistep finite control set model predictive control method for linear induction machines according to claim 1, further comprising: step 4 of equally dividing output voltage range of an inverter into six sectors designated as first to sixth sectors in a counterclockwise direction, determining the sectors to which reference voltage vectors at time V_(k+1), L, V_(k+N) belong one by one, and converting a reference voltage vector angle of each sector to a first sector; step 5 of performing filtering and sorting to obtain an inverter candidate output voltage sequence $S_{n}^{k + i} = \left\{ \begin{matrix} {{{\left\{ {V_{n},V_{n + 1},V_{0}} \right\}\mspace{20mu} X} > 0},{Y > 0}} \\ {{{\left\{ {V_{n},V_{n - 1},V_{0}} \right\}\mspace{20mu} X} > 0},{Y < 0}} \\ {{{\left\{ {V_{0},V_{n},V_{n + 1}} \right\}\mspace{20mu} X} < 0},{Y > 0}} \\ {{{\left\{ {V_{0},V_{n},V_{n - 1}} \right\}\mspace{20mu} X} < 0},{Y < 0}} \end{matrix} \right.$ according to a reference voltage vector Ū*_((N+1−i)(k+i)) converted into the first sector, wherein X=Re(Ū*_((N+1−i)(k+i)))−V_(dc)/3, Y=IM(Ū*_((N+1−i)(k+i)), V_(dc) is a direct-current bus voltage, V₀ is a zero voltage vector outputted by the inverter, and V_(n), V_(n+1), V_(n−1) are non-zero voltage vectors outputted by the inverter; step 6 of searching for an optimal voltage vector sequence from the inverter candidate output voltage sequence S_(n) ^(k+i) by treating minimizing a cost function value as a goal.
 3. The multistep finite control set model predictive control method for linear induction machines according to claim 1, wherein the reference voltage vector angle of each sector is converted to the first sector through an angle conversion formula, and the angle conversion formula is: $T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}$ wherein n is a serial number of the sector to which the reference voltage vector belongs.
 4. The multistep finite control set model predictive control method for linear induction machines according to claim 1, wherein the cost function value is represented as: ${J_{N} = {\sum\limits_{i = 1}^{N}{K_{i}{{S_{n}^{k + i} - U_{{({N + 1 - i})}{({k + i})}}^{*}}}^{2}}}},$ wherein: $\quad\left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix},} \right.$ and U*_((N+1−i)(k+i)) represents the reference voltage vector at the (k+i)th time step.
 5. A multistep finite control set model predictive control system for linear induction machines, comprising following modules: a sampling module, configured to collect and convert a primary phase current i_(p) ^(k) of a linear induction machine in a three-phase coordinate system to an αβ coordinate system to obtain a current vector value I₁ ^(k) at kth time step of present; a current conversion module, configured to predict a current vector value I₁ ^(k+1) at (k+1)th time step according to the current vector value I₁ ^(k) at the kth time step; and a reference voltage vector prediction module, configured to calculate a reference voltage vector $U_{{({N + 1 - i})}{({k + i})}}^{*} = \frac{V_{k + i}^{*} + {\lambda V_{1}^{k + i - 1}} + {k_{1}V_{k + i}^{1}} + \ldots + {k_{N - i}V_{k + i}^{N - i}}}{1 + \lambda + k_{1} + \ldots + k_{N - i}}$ at the (k+i)th time step by iteration by treating the current vector value I₁ ^(k+1) as an initial value, wherein predictive time i=1, L, N, and N is a total predictive step number, wherein ${V_{k + i}^{*} = {{\left( {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}} \right)I_{1}^{k + i}} + {\frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}I_{1}^{*}} - {\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}},V_{1}^{k + i - 1}$ is a voltage vector selected at (k+i−1)th time step, ${V_{k + i}^{h} = \frac{{K_{h\; 1}I_{1}^{k + i}} + {K_{hG}G_{k + 1}} + {K_{hL}L_{\psi}^{k + 1}}}{K_{hV}}},{h = 1},L,{N - i},$ λ is a weighting factor, ${k_{1} = \frac{{\lambda\left( {1 - B} \right)}^{2}}{1 + \lambda}},{k_{2} = {\frac{k_{1}\left( {1 + \lambda} \right)}{1 + \lambda + k_{1}}K_{2V}^{2}}},{k_{h} = {\frac{k_{h - 1}\left( {1 + \lambda + k_{1} + \ldots + k_{h - 2}} \right)}{1 + \lambda + k_{1} + \ldots + k_{h - 1}}K_{hV}^{2}}},{L_{\psi}^{k} = {\frac{L_{r}T_{s}}{\left( {{L_{r}L_{s}} - L_{m}^{2}} \right)}\left( {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} - {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}} \right)}},{G_{k + 1} = {{aL_{\psi}^{k + 1}} + {bI}_{1}^{*} + D_{\psi}^{k + 1}}},$ a and b are coefficients, ${a = {\frac{{L_{r}^{2}R_{1}} + {R_{2}L_{m}^{2}}}{L_{r}^{2}} - \frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}}},{b\frac{{L_{r}L_{s}} - L_{m}^{2}}{L_{r}T_{s}}},{and}$ ${D_{\psi}^{k + 1} = {{\frac{R_{2}L_{m}}{L_{r}^{2}}\psi_{2}} + {j\frac{L_{m}}{L_{r}}\omega_{2}\psi_{2}}}},$ wherein T_(s) is a sampling period, I*₁ is a reference current command, j represents an imaginary part, R represents resistance, ψ represents flux linkage of linear induction machine, subscripts 1 and 2 respectively represent a primary variable and a secondary variable of the linear induction machine, ω₂ represents a secondary angular velocity, L_(l) represents leakage inductance of the linear induction machine; L_(r) is secondary inductance, L_(s) is primary inductance, and L_(m) is mutual inductance.
 6. The multistep finite control set model predictive control system for linear induction machines according to claim 5, further comprising following modules: a sector processing module, configured to equally divide output voltage range of an inverter into six sectors designated as first to sixth sectors in a counterclockwise direction, determine the sectors to which reference voltage vectors at time V_(k+1), L, V_(k+N) belong one by one, and convert a reference voltage vector angle of each sector to a first sector; a filtering and sorting module, configured to perform filtering and sorting to obtain an inverter candidate output voltage sequence $S_{n}^{k + i} = \left\{ \begin{matrix} {\left\{ {V_{n},V_{n + 1},V_{0}} \right\}\ } & {{X > 0},{Y > 0}} \\ {\left\{ {V_{n},V_{n - 1},V_{0}} \right\}\ } & {{X > 0},{Y < 0}} \\ {\left\{ {V_{0},V_{n},V_{n + 1}} \right\}\ } & {{X < 0},{Y > 0}} \\ {\left\{ {V_{0},V_{n},V_{n - 1}} \right\}\ } & {{X < 0},{Y < 0}} \end{matrix} \right.$ according to a reference voltage vector Ū*_((N+1−i)(k+i)) converted into the first sector, wherein X=Re(Ū*_((N+1−i)(k+i))−V_(dc)/3, Y=Im(Ū*_((N+1−i)(k+i)), V_(dc) is a direct-current bus voltage, V₀ is a zero voltage vector outputted by the inverter, and V_(n), V_(n+1), V_(n−1) are non-zero voltage vectors outputted by the inverter; and an optimization searching module, configured to search for an optimal voltage vector sequence from the inverter candidate output voltage sequence S_(n) ^(k+i) by treating minimizing a cost function value as a goal.
 7. The multistep finite control set model predictive control system for linear induction machines according to claim 5, wherein the sector processing module converts the reference voltage vector angle of each sector to the first sector through an angle conversion formula, and the angle conversion formula is: $T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}$ wherein n is a serial number of the sector to which the reference voltage vector belongs.
 8. The multistep finite control set model predictive control system for linear induction machines according to claim 5, wherein the cost function value in the optimization searching module is represented as: ${J_{N} = {\sum\limits_{i = 1}^{N}{K_{i}{{S_{n}^{k + i} - U_{{({N + 1 - i})}{({k + 1})}}^{*}}}^{2}}}},$ wherein $\left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix}.} \right.$
 9. The multistep finite control set model predictive control method for linear induction machines according to claim 2, wherein the reference voltage vector angle of each sector is converted to the first sector through an angle conversion formula, and the angle conversion formula is: $T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}$ wherein n is a serial number of the sector to which the reference voltage vector belongs.
 10. The multistep finite control set model predictive control method for linear induction machines according to claim 2, wherein the cost function value is represented as: ${J_{N} = {\sum\limits_{i = 1}^{N}{K_{i}{{S_{n}^{k + i} - U_{{({N + 1 - i})}{({k + 1})}}^{*}}}^{2}}}},$ wherein: $\quad\left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix},} \right.$ and U*_((N+1−i)(k+i)) represents the reference voltage vector at the (k+i)th time step.
 11. The multistep finite control set model predictive control system for linear induction machines according to claim 6, wherein the sector processing module converts the reference voltage vector angle of each sector to the first sector through an angle conversion formula, and the angle conversion formula is: $T = \begin{bmatrix} {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} & {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \\ {- {\sin\left( \frac{\left( {n - 1} \right)\pi}{3} \right)}} & {\cos\left( \frac{\left( {n - 1} \right)\pi}{3} \right)} \end{bmatrix}$ wherein n is a serial number of the sector to which the reference voltage vector belongs.
 12. The multistep finite control set model predictive control system for linear induction machines according to claim 6, wherein the cost function value in the optimization searching module is represented as: ${J_{N} = {\sum\limits_{i = 1}^{N}{K_{i}{{S_{n}^{k + i} - U_{{({N + 1 - i})}{({k + i})}}^{*}}}^{2}}}},$ wherein $\left\{ {\begin{matrix} {K_{1} = {1 + \lambda + k_{1} + \ldots + k_{N - 1}}} \\ \ldots \\ {K_{N - 1} = {1 + \lambda + k_{1}}} \\ {K_{N} = {1 + \lambda}} \end{matrix}.} \right.$ 